Graph-based Codes
نویسندگان
چکیده
This is a mini-course on graph-based codes, given at the Center for Theoretical Sciences at Taipei, Taiwan, July 12-15, 2004. In practical coding theory, the main challenge has been to find codes with rates close to channel capacity and with efficient encoding and decoding algorithms. Only recently was this accomplished, theoretically for the binary erasure channel but only experimentally for the binary symmetric and AWGN channels. The classes of codes are related to graphs with message passing along edges providing the decoding. Analyzing them and designing them leads to interesting mathematics, much of it still unresolved.
منابع مشابه
Epileptic seizure detection based on The Limited Penetrable visibility graph algorithm and graph properties
Introduction: Epileptic seizure detection is a key step for both researchers and epilepsy specialists for epilepsy assessment due to the non-stationariness and chaos in the electroencephalogram (EEG) signals. Current research is directed toward the development of an efficient method for epilepsy or seizure detection based the limited penetrable visibility graph (LPVG) algorith...
متن کاملUse of Structure Codes (Counts) for Computing Topological Indices of Carbon Nanotubes: Sadhana (Sd) Index of Phenylenes and its Hexagonal Squeezes
Structural codes vis-a-vis structural counts, like polynomials of a molecular graph, are important in computing graph-theoretical descriptors which are commonly known as topological indices. These indices are most important for characterizing carbon nanotubes (CNTs). In this paper we have computed Sadhana index (Sd) for phenylenes and their hexagonal squeezes using structural codes (counts). Sa...
متن کاملLinear codes with complementary duals related to the complement of the Higman-Sims graph
In this paper we study codes $C_p(overline{{rm HiS}})$ where $p =3,7, 11$ defined by the 3- 7- and 11-modular representations of the simple sporadic group ${rm HS}$ of Higman and Sims of degree 100. With exception of $p=11$ the codes are those defined by the row span of the adjacency matrix of the complement of the Higman-Sims graph over $GF(3)$ and $GF(7).$ We show that these codes ha...
متن کاملGenealogical method of urban typo-morphology with the aim of deriving pattern for providing form-based codes
Introduction: The emergence of form-based codes (FBCs), along with the familiar and near-universal rejection of conventional zoning, is a complex story, and more interesting than might first be supposed. The Codes Study generally does not track developer-driven form-based codes. The socio-economic context of form-based codes has shown positive FBC impacts on physical and environmental well-bein...
متن کاملWoven convolutional graph codes with large free distances
Constructions of woven graph codes based on constituent convolutional codes are studied, and examples of woven convolutional graph codes are presented. Existence of codes satisfying the Costello lower bound on the free distance within a random ensemble of woven graph codes based on s-partite, s-uniform hypergraphs is shown, where s depends only on the code rate. Simulation results for Viterbi d...
متن کاملA Polynomial Algorithm for Codes Based on Directed Graphs
A complete description and proof of correctness are given for a new polynomial time algorithm for a class of codes based on directed graphs and involving construction well known in system theory. Our construction has already been considered in the literature in relation to other questions. The investigation of codes in this graph-based construction is inspired by analogy with classical cyclic c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004